Approximating poles of complex rational functions
نویسنده
چکیده
In this paper we investigate the application of the Nelder– Mead simplex method to approximate poles of complex rational functions. To our knowledge, there isn’t any algorithm which is able to find the poles of a function when only the values on the unit circle are given. We will show that this method can accurately approximate 1, 2 or even 3 poles without any preliminary knowledge of their locations. The work presented here has implications in the study of ECG signals.
منابع مشابه
The Convergence of Rational Functions of Best Approximation to the Exponential Function
The object of the paper is to establish convergence throughout the entire complex plane of sequences of rational functions of prescribed types which satisfy a certain degree of approximation to the function aeyz on the disk \z\ S p. It is assumed that the approximating rational functions have a bounded number of free poles. Estimates are given for the degree of best approximation to the exponen...
متن کاملExplicit Nearly Optimal Linear Rational Approximation with Preassigned Poles
This paper gives explicit rational functions for interpolating and approximating functions on the intervals [-1,1], [0, oo], and [-oo, oo]. The rational functions are linear in the functions to be approximated, and they have preassigned poles. The error of approximation of these rationals is nearly as small as the error of best rational approximation with numerator and denominator polynomials o...
متن کاملOn the maximal ideal space of extended polynomial and rational uniform algebras
Let K and X be compact plane sets such that K X. Let P(K)be the uniform closure of polynomials on K. Let R(K) be the closure of rationalfunctions K with poles o K. Dene P(X;K) and R(X;K) to be the uniformalgebras of functions in C(X) whose restriction to K belongs to P(K) and R(K),respectively. Let CZ(X;K) be the Banach algebra of functions f in C(X) suchthat fjK = 0. In this paper, we show th...
متن کاملRational Gauss-Chebyshev quadrature formulas for complex poles outside [-1, 1]
In this paper we provide an extension of the Chebyshev orthogonal rational functions with arbitrary real poles outside [−1, 1] to arbitrary complex poles outside [−1, 1]. The zeros of these orthogonal rational functions are not necessarily real anymore. By using the related para-orthogonal functions, however, we obtain an expression for the nodes and weights for rational Gauss-Chebyshev quadrat...
متن کاملComputing rational Gauss-Chebyshev quadrature formulas with complex poles: The algorithm
We provide an algorithm to compute arbitrarily many nodes and weights for rational Gauss-Chebyshev quadrature formulas integrating exactly in spaces of rational functions with complex poles outside [−1, 1]. Contrary to existing rational quadrature formulas, the computational effort is very low, even for extremely high degrees, and under certain conditions on the poles it can be shown that the c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009